Chain hexagonal cacti: extremal with respect to the eccentric connectivity index

نویسندگان

  • S. MORADI Arak University, Iran
  • T. DOŠLIĆ University of Zagreb,Croatia
  • Z. YARAHMADI Khorramabad Branch, Islamic Azad University, Iran
چکیده مقاله:

In this paper we present explicit formulas for the eccentric connectivity index of three classes of chain hexagonal cacti. Further, it is shown that the extremal chain hexagonal cacti with respect to the eccentric connectivity index belong to one of the considered types. Some open problems and possible directions of further research are mentioned in the concluding section.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

chain hexagonal cacti: extremal with respect to the eccentric connectivity index

in this paper we present explicit formulas for the eccentric connectivity index of three classesof chain hexagonal cacti. further, it is shown that the extremal chain hexagonal cacti withrespect to the eccentric connectivity index belong to one of the considered types. some openproblems and possible directions of further research are mentioned in the concluding section.

متن کامل

Chain Hexagonal Cacti with the Extremal Eccentric Distance Sum

Eccentric distance sum (EDS), which can predict biological and physical properties, is a topological index based on the eccentricity of a graph. In this paper we characterize the chain hexagonal cactus with the minimal and the maximal eccentric distance sum among all chain hexagonal cacti of length n, respectively. Moreover, we present exact formulas for EDS of two types of hexagonal cacti.

متن کامل

Eccentric Connectivity Index: Extremal Graphs and Values

Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...

متن کامل

eccentric connectivity index: extremal graphs and values

eccentric connectivity index has been found to have a low degeneracy and hence a significantpotential of predicting biological activity of certain classes of chemical compounds. wepresent here explicit formulas for eccentric connectivity index of various families of graphs.we also show that the eccentric connectivity index grows at most polynomially with thenumber of vertices and determine the ...

متن کامل

Eccentric connectivity index: extremal graphs and values

Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...

متن کامل

Cacti with Extremal Pi Index

The vertex PI index PI(G) = ∑ xy∈E(G)[nxy(x) + nxy(y)] is a distance-based molecular structure descriptor, where nxy(x) denotes the number of vertices which are closer to the vertex x than to the vertex y and which has been the considerable research in computational chemistry dating back to Harold Wiener in 1947. A connected graph is a cactus if any two of its cycles have at most one common ver...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 4  شماره 1

صفحات  123- 136

تاریخ انتشار 2013-03-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023